基于线特征及迭代最近点算法的地基建筑物点云自动配准方法

为克服迭代最近点(ICP)算法易陷入局部最优的缺陷，提出一种基于线特征及ICP算法的地基建筑物点云自动配准方法。首先，基于法向一致性进行建筑物点云平面分割；接着，采用alpha-shape算法进行点簇轮廓线提取，并拆分和拟合处理得到特征线段；然后，以线对作为配准基元，以线对夹角和距离作为相似性测度进行同名特征匹配，实现建筑物点云的粗配准；最后，以粗配准结果为初值，进一步采用ICP算法完成点云精确配准。利用两组部分重叠的建筑物点云进行配准实验，实验结果表明，采用由粗到精的配准方法能有效改善ICP算法对初值依赖的问题，实现具有部分重叠的建筑物点云的有效配准。     

Backtesting portfolio value-at-risk with estimated portfolio weights

This article theoretically and empirically analyzes backtesting portfolio value-at-risk (VaR) with estimation risk in an intrinsically multi-variate framework. It particularly takes into account the estimation of portfolio weights in forecasting portfolio VaR and its impact on backtesting. It shows that the estimation risk from estimating portfolio weights and that from estimating the multi-variate dynamic model make the existing methods in a univariate framework inapplicable. It proposes a general theory to quantify estimation risk applicable to the present problem and suggests practitioners a simple but effective way to implement valid inference to overcome the effect of estimation risk in backtesting portfolio VaR. In particular, we apply our theory to the efficient mean-variance-skewness portfolio for a multi-variate generalized autoregressive conditional heteroscedasticity model with multi-variate general hyperbolic distributed innovations. Some Monte Carlo simulations and an empirical application demonstrate the merits of our method.     

Maximum likelihood-based adaptive differential evolution identification algorithm for multivariable systems in the state-space form

Parameter estimation plays an important role in the field of system control. This article is concerned with the parameter estimation methods for multivariable systems in the state-space form. For the sake of solving the identification complexity caused by a large number of parameters in multivariable systems, we decompose the original multivariable system into some subsystems containing fewer parameters and study identification algorithms to estimate the parameters of each subsystem. By taking the maximum likelihood criterion function as the fitness function of the differential evolution algorithm, we present a maximum likelihood-based differential evolution (ML-DE) algorithm for parameter estimation. To improve the parameter estimation accuracy, we introduce the adaptive mutation factor and the adaptive crossover factor into the ML-DE algorithm and propose a maximum likelihood-based adaptive differential evolution algorithm. The simulation study indicates the efficiency of the proposed algorithms.     

“都林”机器人内板连续式喷涂技术应用浅析

结合新工厂的应用经验,通过对"都林"机器人的喷涂方式、布局、雾化器配置选型、参数设置、仿形设计及品质控制要点等方面的分析,总结了连续式喷涂的优势及技术控制要求。     

Microscopic melanoma detection and classification: A framework of pixel‐based fusion and multilevel features reduction

The numbers of diagnosed patients by melanoma are drastic and contribute more deaths annually among young peoples. An approximately 192,310 new cases of skin cancer are diagnosed in 2019, which shows the importance of automated systems for the diagnosis process. Accordingly, this article presents an automated method for skin lesions detection and recognition using pixel‐based seed segmented images fusion and multilevel features reduction. The proposed method involves four key steps: (a) mean‐based function is implemented and fed input to top‐hat and bottom‐hat filters which later fused for contrast stretching, (b) seed region growing and graph‐cut method‐based lesion segmentation and fused both segmented lesions through pixel‐based fusion, (c) multilevel features such as histogram oriented gradient (HOG), speeded up robust features (SURF), and color are extracted and simple concatenation is performed, and (d) finally variance precise entropy‐based features reduction and classification through SVM via cubic kernel function. Two different experiments are performed for the evaluation of this method. The segmentation performance is evaluated on PH2, ISBI2016, and ISIC2017 with an accuracy of 95.86, 94.79, and 94.92%, respectively. The classification performance is evaluated on PH2 and ISBI2016 dataset with an accuracy of 98.20 and 95.42%, respectively. The results of the proposed automated systems are outstanding as compared to the current techniques reported in state of art, which demonstrate the validity of the proposed method.     

基于词法特征的恶意域名快速检测算法

针对互联网中恶意域名攻击事件频发，现有域名检测方法实时性不强的问题，提出一种基于词法特征的恶意域名快速检测算法。该算法根据恶意域名的特点，首先将所有待测域名按照长度进行正则化处理后赋予权值；然后利用聚类算法将待测域名划分成多个小组，并利用改进的堆排序算法按照组内权值总和计算各域名小组优先级，根据优先级降序依次计算各域名小组中每一域名与黑名单上域名之间的编辑距离；最后依据编辑距离值快速判定恶意域名。算法运行结果表明，基于词法特征的恶意域名快速检测算法与单一使用域名语义和单一使用域名词法的恶意域名检测算法相比，准确率分别提高1.7%与2.5%，检测速率分别提高13.9%与6.8%，具有更高的准确率和实时性。     

Shape from focus based on 3D structure tensor using optical microscopy

Shape from focus (SFF) is a widely used passive optical method for 3D shape reconstruction. In SFF, a focus measure, which is used to estimate the relative focus level, plays a critical role in depth estimation. In this article, we present a new focus measure for accurate 3D shape estimation in optical microscopy based on the analysis of 3D structure tensor. First, the 3D tensors are computed from the input image sequence for each pixel. Then, each tensor is decomposed into point, curve, and surface tensors by decomposing tensors into eigenvalues and eigenvectors. Finally, the surfaceness is used to measure the quality of sharpness. The proposed focus measure provides accurate focus values and better resistance against noise. The proposed measure is evaluated by conducting experiments using image sequences of simulated and microscopic real objects. The comparative analysis demonstrates the effectiveness of the proposed focus measure in recovering 3D shape.     

A multi-tone central divided difference frequency tracker with adaptive process noise covariance tuning

The problem of real-time frequency estimation of nonstationary multi-harmonic signals is important in many applications. In this paper, we propose a novel multi-frequency tracker based on a state-space representation of the signal with Cartesian filters and the second-order central divided difference filter (CDDF), which improves the performance of the extended Kalman filter (EKF) by using Stirling's interpolation method to approximate the mean and covariance of the state vector. A crucial element of the method is the adaptive scaling of the process noise covariance matrix appearing in the filter equations, as a function of the innovation sequence, which tunes the accuracy-reactivity trade-off of the filter. The proposed solution is evaluated against two approaches from the literature, namely the factorized adaptive notch filter (FANF) and the extended Kalman filter frequency tracker (EKFFT). Several experiments emphasize the estimation accuracy of the proposed method as well as the improved robustness with respect to initial errors and input signal complexity. The presented method appears to be particularly efficient with rapidly varying frequencies, thanks to the update mechanism that adjusts the filter parameters based on the amplitude of the estimation error.     

基于改进交叉熵算法的电力系统随机生产模拟

蒙特卡洛模拟的计算效率与系统的可靠性密切相关，在其用于高可靠性系统的随机模拟时存在计算效率偏低的问题。为此，提出了一种基于多层交叉熵与对偶变数抽样技术相结合的随机模拟算法。首先使用多层交叉熵构造零方差概率密度函数的近似函数，提高小概率失效事件的抽取概率；其次基于已构造的近似概率函数，采用对偶变数抽样法进行抽样，进一步提高抽样的收敛速度。以IEEE RTS修改系统为例进行了算例分析，算例结果验证了所提出的基于改进交叉熵的电力系统随机生产模拟算法的有效性。     

Distributed data-driven observer for linear time invariant systems

This paper is concerned with distributed data-driven observer design problem. The existing data-driven observers rely on a common assumption that all the information about the system, and the calculations based upon this information are centralized. Therefore the resulting algorithms cannot be applied to the distributed systems in which each local observer receives only a part of the output signal. On the other hand, traditional model-based distributed state estimation methods generally assume that the processes are decomposed according to the known process models, while in data-driven approaches there is no such information available. The main goal of this paper is to extend the centralized data-driven observer design approach to the distributed framework. The stability of the proposed data-driven distributed observer is also proved analytically. A quadruple-tank process is simulated to demonstrate the performance of the proposed scheme.